Hamilton cycles in graph bundles over a cycle with tree as a fibre
نویسندگان
چکیده
منابع مشابه
The chromatic numbers of graph bundles over cycles
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers of product bundles with respect to the Cartesian, strong and tensor product whose base and fiber are cycles are determined.
متن کاملDisjoint Hamilton cycles in the star graph
In 1987, Akers, Harel and Krishnamurthy proposed the star graph Σ(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that Σ(n) contains bn/8c pairwise edge-disjoint Hamilton cycles when n is prime, and Ω(n/ log log n) such cycles for arbitrary n.
متن کاملOn the number of hamilton cycles in a random graph
Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (logn)^ * distinct hamilton cycles for any fixed e > 0. §1, Introduction Let V = {lf2,...,n} and consider the random graph process (Bollobas [3]) G0,Gr ....G^, v = (£) wher...
متن کاملSquare of a Hamilton cycle in a random graph
We show that the threshold for the random graph Gn,p to contain the square of a Hamilton cycle is p = 1 √ n . This improves the previous results of Kühn and Osthus and also Nenadov and Škorić.
متن کاملHamilton cycles in prisms over graphs
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be a good measure how close a graph is to being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of hamiltonian prisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.11.037